Comparative Analysis of Time Steps Distribution in Runge-Kutta Algorithms
ثبت نشده
چکیده
This study utilized combination of phase plots,time steps distribution and adaptive time steps Runge-Kutta and f if th order algorithms to investigate a harmonically Duff ing oscillator.The object is to visually compare fourth and f if th order Runge-Kutta algorithms performance as tools for seeking the chaotic solutions of a harmonically excited Duffing oscillator.Though fif th order algorithms favours higher time steps and as such faster to execute than fourth order for all studied cases.The reliability of results obtained w ith fourth order worth its higher recorded total computation time steps period. Keywords— Algorithms, Chaotic Solutions, Duff ing Oscillator, Harmonically Excited, Phase Plots, Runge-Kutta and Time Steps —————————— ——————————
منابع مشابه
On numerical simulations of integrate - and - re neural
It is shown that very small time steps are required to correctly reproduce the synchronization properties of large networks of integrate-and-re neurons when the diierential system describing their dynamics is integrated with the standard Euler or second order Runge-Kutta algorithms. The reason for that behavior is analyzed and a simple improvement of these algorithms is proposed.
متن کاملTime integration of rectangular membrane free vibration using spline-based differential quadrature
In this paper, numerical spline-based differential quadrature is presented for solving the boundary and initial value problems, and its application is used to solve the fixed rectangular membrane vibration equation. For the time integration of the problem, the Runge–Kutta and spline-based differential quadrature methods have been applied. The Runge–Kutta method was unstable for solving the prob...
متن کاملError Analysis of Explicit Partitioned Runge-Kutta Schemes for Conservation Laws
An error analysis is presented for explicit partitioned Runge–Kutta methods and multirate methods applied to conservation laws. The interfaces, across which different methods or time steps are used, lead to order reduction of the schemes. Along with cell-based decompositions, also flux-based decompositions are studied. In the latter case mass conservation is guaranteed, but it will be seen that...
متن کاملForward Symplectic Integrators for Solving Gravitational Few-Body Problems
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in additional to the force. We demonstrate the efficiency of these Forward Symplectic Integrators by solving the circularly restricted three-body problem in the space...
متن کاملSimple ODE Solvers - Error Behaviour
y(t0) = y0 Here f(t, y) is a given function, t0 is a given initial time and y0 is a given initial value for y. The unknown in the problem is the function y(t). Two obvious considerations in deciding whether or not a given algorithm is of any practical value are (a) the amount of computational effort required to execute the algorithm and (b) the accuracy that this computational effort yields. Fo...
متن کامل